Proving Key Usage
نویسندگان
چکیده
In the context of a validation server, or more general PKI server, it could be interesting to give the server the possibility to check whether a certain public key was used. We investigate here some possibilities. We also present an escrow system as an application of the technology.
منابع مشابه
Universally Composable Key - Management ( full version )
We present the first universally composable key-management functionality, formalized in the GNUC framework by Hofheinz and Shoup. It allows the enforcement of a wide range of security policies and can be extended by diverse key usage operations with no need to repeat the security proof. We illustrate its use by proving an implementation of a security token secure with respect to arbitrary key-u...
متن کاملUniversally Composable Key-Management
We present the first universally composable key-management functionality, formalized in the GNUC framework by Hofheinz and Shoup. It allows the enforcement of a wide range of security policies and can be extended by diverse key usage operations with no need to repeat the security proof. We illustrate its use by proving an implementation of a security token secure with respect to arbitrary key-u...
متن کاملCosmological argument in proving the existence of God from Imam Khomeini's (RA) point of view
This article reviews Cosmological argument in proving the existence of God from the viewpoint of Imam Khomeini (RA). At first, various views to the existence of God are reviewed and then its etymology will be reviewed. Cosmological argument proves God through universal premises about truth and world and and the Movement Argument, Casual Argument and Necessity and Possibility Argument are dif...
متن کاملNew Issues and Solutions in Computer-aided Design of MCTI and Distractor Selection for Bulgarian
We describe a methodology for improving the generation of multiple-choice test items through the usage of language technologies. We apply common natural language processing techniques, like constituency parsing and automatic term extraction together with additional morphosyntactic rules on raw instructional material in order to determine its key terms. These key terms are then used for the crea...
متن کاملTest Data Generation for Programs with Quantified First-Order Logic Specifications
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic execution, theorem proving, satisfiability solving, and usage of specifications and program annotations such as loop invariants. These techniques are suitable for testing of small programs, such as, e.g., implementation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004